Parallel-iterated pseudo two-step Runge-Kutta-Nyström methods for nonstiff second-order IVPs
نویسندگان
چکیده
منابع مشابه
Parallel Iterated Runge Kutta Methods and Applications
The iterated Runge Kutta IRK method is an iteration scheme for the numerical solu tion of initial value problems IVP of ordinary di erential equations ODEs that is based on a predictor corrector method with an Runge Kutta RK method as corrector Embed ded approximation formulae are used to control the stepsize We present di erent parallel algorithms of the IRK method on distributed memory multip...
متن کاملExplicit Two-Step Methods for Second-Order Linear IVPs
we present a new type of method for the integration of systems of linear inhomogeneous initial value problems with constant coefficients. Our methods are of hybrid explicit Numerov type. The methods are constructed without the intermediate use of high accuracy interpolatory nodes, since only the Taylor expansion at the internal points is needed. Then we derive the order conditions taking advant...
متن کاملRunge-Kutta-Nyström-type parallel block predictor-corrector methods
This paper describes the construction of block predictor-corrector methods based on Runge-Kutta-Nystrr om correctors. Our approach is to apply the predictor-corrector method not only with stepsize h, but, in addition (and simultaneously) with stepsizes a i h; i = 1; : : :; r. In this way, at each step, a whole block of approximations to the exact solution at oo-step points is computed. In the n...
متن کاملHigh Order Explicit Two - Step Runge - Kutta
In this paper we study a class of explicit pseudo two-step Runge-Kutta methods (EPTRK methods) with additional weights v. These methods are especially designed for parallel computers. We study s-stage methods with local stage order s and local step order s + 2 and derive a suucient condition for global convergence order s+2 for xed step sizes. Numerical experiments with 4-and 5-stage methods sh...
متن کاملHigh Order Explicit Two-Step Runge-Kutta Methods for Parallel Computers
R n , parameters A aij R s , c b R , 1l : 1 1 T and step size hm. F denotes the straightforward extension of f to R . Here, denotes the Kronecker tensor product. Notice that the EPTRK method 2 requires only one sequential function evaluation per step on a parallel computer with s processing elements. Numerical experiments with a variable step size implementation on a shared memory computer have...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2002
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(02)00136-0